package algorithm;

import util.TreeNode;

/**
 * Description:
 * 给定一个二叉树，找出其最大深度。二叉树的深度为根节点到最远叶子节点的最长路径上的节点数
 * @author: chengrongkai
 * Date: 2021/3/11
 */
public class Solution27 {

    public static void main(String[] args) {
        Integer[] nums = {3,9,20,null,null,15,7};
        TreeNode treeNode = TreeNode.getTreeNode(nums);
        int solution = solution(treeNode);
        System.out.println(solution);
    }

    public static int solution(TreeNode treeNode){
        return 0;
    }
}
